Termination w.r.t. Q proof of TRS/TRCSREx5_Zan97

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

a__f₁(X) -> a__if₃(mark₁(X), c, f₁(true))
a__if₃(true, X, Y) -> mark₁(X)
a__if₃(false, X, Y) -> mark₁(Y)
mark₁(f₁(X)) -> a__f₁(mark₁(X))
mark₁(if₃(X1, X2, X3)) -> a__if₃(mark₁(X1), mark₁(X2), X3)
mark₁(c) -> c
mark₁(true) -> true
mark₁(false) -> false
a__f₁(X) -> f₁(X)
a__if₃(X1, X2, X3) -> if₃(X1, X2, X3)

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

a__f₁(X) -> a__if₃(mark₁(X), c, f₁(true))
a__if₃(true, X, Y) -> mark₁(X)
a__if₃(false, X, Y) -> mark₁(Y)
mark₁(f₁(X)) -> a__f₁(mark₁(X))
mark₁(if₃(X1, X2, X3)) -> a__if₃(mark₁(X1), mark₁(X2), X3)
mark₁(c) -> c
mark₁(true) -> true
mark₁(false) -> false
a__f₁(X) -> f₁(X)
a__if₃(X1, X2, X3) -> if₃(X1, X2, X3)

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

MARK₁(if₃(X1, X2, X3)) -> MARK₁(X1)
A__F₁(X) -> A__IF₃(mark₁(X), c, f₁(true))
MARK₁(f₁(X)) -> A__F₁(mark₁(X))
A__IF₃(false, X, Y) -> MARK₁(Y)
A__F₁(X) -> MARK₁(X)
A__IF₃(true, X, Y) -> MARK₁(X)
MARK₁(if₃(X1, X2, X3)) -> MARK₁(X2)
MARK₁(if₃(X1, X2, X3)) -> A__IF₃(mark₁(X1), mark₁(X2), X3)
MARK₁(f₁(X)) -> MARK₁(X)

The TRS R consists of the following rules:

a__f₁(X) -> a__if₃(mark₁(X), c, f₁(true))
a__if₃(true, X, Y) -> mark₁(X)
a__if₃(false, X, Y) -> mark₁(Y)
mark₁(f₁(X)) -> a__f₁(mark₁(X))
mark₁(if₃(X1, X2, X3)) -> a__if₃(mark₁(X1), mark₁(X2), X3)
mark₁(c) -> c
mark₁(true) -> true
mark₁(false) -> false
a__f₁(X) -> f₁(X)
a__if₃(X1, X2, X3) -> if₃(X1, X2, X3)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

MARK₁(if₃(X1, X2, X3)) -> MARK₁(X1)
A__F₁(X) -> A__IF₃(mark₁(X), c, f₁(true))
MARK₁(f₁(X)) -> A__F₁(mark₁(X))
A__IF₃(false, X, Y) -> MARK₁(Y)
A__F₁(X) -> MARK₁(X)
A__IF₃(true, X, Y) -> MARK₁(X)
MARK₁(if₃(X1, X2, X3)) -> MARK₁(X2)
MARK₁(if₃(X1, X2, X3)) -> A__IF₃(mark₁(X1), mark₁(X2), X3)
MARK₁(f₁(X)) -> MARK₁(X)

The TRS R consists of the following rules:

a__f₁(X) -> a__if₃(mark₁(X), c, f₁(true))
a__if₃(true, X, Y) -> mark₁(X)
a__if₃(false, X, Y) -> mark₁(Y)
mark₁(f₁(X)) -> a__f₁(mark₁(X))
mark₁(if₃(X1, X2, X3)) -> a__if₃(mark₁(X1), mark₁(X2), X3)
mark₁(c) -> c
mark₁(true) -> true
mark₁(false) -> false
a__f₁(X) -> f₁(X)
a__if₃(X1, X2, X3) -> if₃(X1, X2, X3)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.